Universality Class of Probabilistic Cellular Automata
نویسندگان
چکیده
The Ising-like phase transition is considered in probabilistic cellular automata (CA). The nonequilibrium CA with Toom rule are compared to standard equilibrium lattice systems to verify influence of synchronous vs asynchronous updating. It was observed by Marcq et al. [Phys.Rev.E 55(1997) 2606] that the mode of updating separates systems of coupled map lattices into two distinct universality classes. The similar partition holds in case of CA. CA with Toom rule and synchronous updating represent the weak universality class of the Ising model, while Toom CA with asynchronous updating fall into the Ising universality class.
منابع مشابه
Directed Percolation arising in Stochastic Cellular Automata
Cellular automata are both seen as a model of computation and as tools to model real life systems. Historically they were studied under synchronous dynamics where all the cells of the system are updated at each time step. Meanwhile the question of probabilistic dynamics emerges: on the one hand, to develop cellular automata which are capable of reliable computation even when some random errors ...
متن کاملCan the Ising critical behavior survive in non-equilibrium synchronous cellular automata?
Universality classes of Ising-like phase transitions are investigated in series of two-dimensional synchronously updated probabilistic cellular automata (PCAs), whose time evolution rules are either of Glauber type or of majority-vote type, and degrees of anisotropy are varied. Although early works showed that coupled map lattices and PCAs with synchronously updating rules belong to a universal...
متن کاملCan the Ising critical behaviour survive in non-equilibrium synchronous cellular automata?
Universality classes of Ising-like phase transitions are investigated in a series of two-dimensional synchronously updated probabilistic cellular automata (PCAs), whose time evolution rules are either of Glauber type or of majority-vote type, and degrees of anisotropy are varied. Although early works showed that coupled map lattices and PCAs with synchronously updating rules belong to a univers...
متن کاملWhen are cellular automata random ?
A cellular automaton is a collection of cells, each of which is in one of a finite number of states. The cells’ states are updated according to some local rules which take into account the state of the cell and the states of its neighbours. For instance: a two dimensional grid with two states per cell is used in Conway’s Game of Life in which each cell is alive or dead and transition rules are ...
متن کاملA probabilistic cellular automata model for the dynamics of a population driven by logistic growth and weak Allee effect
We investigate the critical behaviour of a one-parameter probabilistic mixture of one-dimensional elementary cellular automata under the guise of a model for the dynamics of a single-species unstructured population with nonoverlapping generations in which individuals have smaller probability of reproducing and surviving in a crowded neighborhood but also suffer from isolation and dispersal. Rem...
متن کامل